def bin_pow(a, x):
if a == 1 or x == 0:
return 1
if x == 1:
return a
if x & 1:
return bin_pow(a, x - 1) * a
else:
temp = bin_pow(a, x >> 1)
return temp * temp
def fact(n):
i = 1
while n:
i *= n
n -= 1
return i
a, b, c = map(int, input().split())
d = (b * b - 4 * a * c) ** 0.5
print(max((-b + d) / 2 / a, (-b - d) / 2 / a))
print(min((-b + d) / 2 / a, (-b - d) / 2 / a))#include<bits/stdc++.h>
using namespace std;
int main()
{
double a,b,c;
cin>>a>>b>>c;
double d=sqrt((b*b)-(4*a*c));
double x1=(-b+d)/(2*a);
double x2=(-b-d)/(2*a);
double mx1=max(x1,x2);
double min1=min(x1,x2);
printf("%.16lf\n",mx1);
printf("%.16lf\n",min1);
}62. Unique Paths | 50. Pow(x, n) |
43. Multiply Strings | 34. Find First and Last Position of Element in Sorted Array |
33. Search in Rotated Sorted Array | 17. Letter Combinations of a Phone Number |
5. Longest Palindromic Substring | 3. Longest Substring Without Repeating Characters |
1312. Minimum Insertion Steps to Make a String Palindrome | 1092. Shortest Common Supersequence |
1044. Longest Duplicate Substring | 1032. Stream of Characters |
987. Vertical Order Traversal of a Binary Tree | 952. Largest Component Size by Common Factor |
212. Word Search II | 174. Dungeon Game |
127. Word Ladder | 123. Best Time to Buy and Sell Stock III |
85. Maximal Rectangle | 84. Largest Rectangle in Histogram |
60. Permutation Sequence | 42. Trapping Rain Water |
32. Longest Valid Parentheses | Cutting a material |
Bubble Sort | Number of triangles |
AND path in a binary tree | Factorial equations |
Removal of vertices | Happy segments |